P3-isomorphisms for graphs
نویسندگان
چکیده
The P3-graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P3-graphs are either isomorphic or part of three exceptional families. We also characterize all isomorphisms between P3-graphs in terms of the original graphs. c © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 35–51, 1997
منابع مشابه
Isomorphisms and traversability of directed path graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → Pk(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k vertices in D. In this introductory paper ...
متن کاملIsomorphisms of Algebras Associated with Directed Graphs
Given countable directed graphs G and G, we show that the associated tensor algebras T+(G) and T+(G ) are isomorphic as Banach algebras if and only if the graphs G are G are isomorphic. For tensor algebras associated with graphs having no sinks or no sources, the graph forms an invariant for algebraic isomorphisms. We also show that given countable directed graphs G, G, the free semigroupoid al...
متن کاملColouring of ( P3 ∪ P2)-free graphs
The class of 2K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3 ∪P2)-free graphs, a super class of 2K2-free graphs. We derive a O(ω3) upper bound for the chromatic number of (P3 ∪P2)-free graphs, and sharper bounds for (P3 ∪P2, diamond)-free graphs, where ω denotes the clique number. By applying simila...
متن کاملP_3-Games
Without further ado, we present the P3-game. The P3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P3-game is fascinating. We show that the connected P3-game is polynomially decidable for classes such as trees, chordal graphs, ladders, cacti, outerplanar graphs and circular arc graphs.
متن کاملExact recovery with symmetries for the Doubly-Stochastic relaxation
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex optimization problem over the set of doubly stochastic matrices. Recent analysis has shown that for almost all pairs of isomorphic and asymmetric graphs, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 26 شماره
صفحات -
تاریخ انتشار 1997